Self-Stabilization by Local Checking: A Summary
نویسنده
چکیده
منابع مشابه
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
We describe a method for transforming asynchronous network protocols into protocols that can sustain any transient fault, i.e., become self-stabilizing. We combine the known notion of local checking with a new notion of internal reset, and prove that given any self-stabilizing internal reset protocol, any locally-checkable protocol can be made self-stabilizing. Our proof is constructive in the ...
متن کاملModel Checking Self-Stabilising in Embedded Systems with Linear Temporal Logic
Over the past two decades, the use of distributed embedded systems is wide in many applications. One way to guarantee that these systems tolerate transient faults is done by making them self-stabilizing systems, which automatically recover from any transient fault. In this paper we present a formalism of self-stabilization concept based on Linear Temporal Logic (LTL), and model checked the self...
متن کاملSelf-Stabilization by Local Checking and Correction
A self-stabilizing protocol is one that begins to behave correctly in bounded time, no matter what state the protocol is started in. Self-stabilization abstracts the ability of a protocol to tolerate arbitrary faults that stop. We investigate the power and applicability of local checking and correction for the design of stabilizing network protocols. A link subsystem is a pair of neighboring no...
متن کاملAnalysis of Self-Stabilization for Infinite-State Systems
For a variety of infinite-state systems, the problem of deciding whether a given system is self-stabilizing or not is investigated from the decidability viewpoint. We develop a unified strategy through which checking self-stabilization is shown to be decidable for lossy vector addition systems with states, one-counter machines, and conflict-free Petri nets. For lossy counter machines and lossy ...
متن کاملTowards scalable model checking of self-stabilizing programs
Existing approaches for verifying self-stabilization with a symbolic model checker have relied on the use of weak fairness. We point out that this approach has limited scalability. To overcome this limitation, first, we show that if self-stabilization is possible without fairness then cost of verifying self-stabilization is substantially lower. In fact, we observe from several case studies that...
متن کامل